package codeRandomThoughts.Test718最长重复子数组;

public class Solution2 {
    public int findLength(int[] nums1, int[] nums2) {
        int maxLen = 0;

        //dp[i][j]:以nums1[i-1]为结尾和以nums2[j-1]为结尾的公共最长子数组的长度
        int[][] dp = new int[nums1.length + 1][nums2.length + 1];

        dp[0][0] = 0;

        //递推
        for (int i = 1; i < nums1.length + 1; i++) {
            for (int j = 1; j < nums2.length + 1; j++) {
                if (nums1[i - 1] == nums2[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }
                if (dp[i][j] > maxLen) {
                    maxLen = dp[i][j];
                }
            }
        }

        return maxLen;
    }
}
